On a problem concerning tolerance graphs
نویسندگان
چکیده
منابع مشابه
On a problem of R. Halin concerning infinite graphs II
For every countable, connected graph A containing no one-way infinite path the following is shown: Let G be an arbitrary graph which contains for every positive integer n a system of n disjoint graphs each isomorphic to a subdivision of A. Then G also contains infinitely many disjoint subgraphs each isomorphic to a subdivision of A. In addition, corrections of errors are given that occur unfort...
متن کاملOn a Conjecture concerning Vertex-transitive Graphs
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture, which would imply the Lovasz conjecture and give an interesting insight on the symmetry of vertex-transitive graphs, if true. Though it could become an approach ...
متن کاملOn a Conjecture Concerning Helly Circle Graphs
We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and ineq...
متن کاملOn a Problem concerning Permutation Polynomials
Let S(f) denote the set of integral ideals / such that / is a permutation polynomial modulo i", where / is a polynomial over the ring of integers of an algebraic number field. We obtain a classification for the sets S which may be written in the form S(f). Introduction. A polynomial f(x) with coefficients in a commutative ring R is said to be a permutation polynomial modulo an ideal I oi R (abb...
متن کاملOn A Problem Concerning Parameter Free Induction
8 0. Preliminaries In this note we comment on the relationships among local versions of the parameter free induction, collection and pigeonhole schemas. We start by defining the versions that will interest us. We work in the usual language of arithmetic to which a new constant symbol a has been added. P-denotes a finite set of axioms such that if M C P-, then M is the nonnegative part of a comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90158-k